#define quickread
#ifdef quickread
#include <cstdio> 
template <typename T>
inline void read(T& x)
{
    int c=getchar(), f=1; x=0;
    while(c<'0'||'9'<c) {if(c=='-') f=-1; c=getchar();}
    while('0'<=c&&c<='9') 
        x=(x<<3)+(x<<1)+c-'0', c=getchar();
    x*=f;
}
template <typename T>
inline void quickwrite(T x)
{
    if(x<0) putchar('-'), x*=-1;
    if(x>=10) quickwrite(x/10);
    putchar(x%10+'0');
}
#else 
#include <iostream>
#endif
#include <algorithm>
using namespace std;
#define DEBUG
#define int long long
using PII=pair<int, int>;
#define enemy first 
#define me second
const int N=1e6+10;
int n, m, q, en=-1; //n次攻击 血量m q次询问 me在第几次攻击会被击杀
int cnt[N], x[N];
PII attack[N];
void init()
{
    read(n), read(m), read(q);
    for(int i=1; i<=n; i++)
    {
        int a; read(a);
        attack[i]=attack[i-1]; cnt[i]=cnt[i-1];
        if(a>0) attack[i].enemy+=a, cnt[i]++;
        else attack[i].me+=a;
        if(en==-1&&m+attack[i].me<=0) en=i; //当前回合me血量清零
    } 
    for(int i=1; i<=q; i++) read(x[i]);
}

void solve()
{
    init();
    // printf("en:%d\n", en);
    for(int i=1; i<=q; i++)
    {
        if(en==-1&&m>attack[n].enemy+cnt[n]*x[i]) //me永远不会被击杀&&enemy不会被击杀
            {puts("Tie"); }
        else if(en==-1&&m<=attack[n].enemy+cnt[n]*x[i]) //me不被击杀&&enemy会被击杀
            {puts("Yes"); }
        else if(m>attack[en].enemy+cnt[en]*x[i]) //me先被击杀
            {puts("No"); }
        else if(m<=attack[en].enemy+cnt[en]*x[i]) //当前回合敌人血量清零
            {puts("Yes"); }
    }
}

// #undef DEBUG
signed main()
{
    #ifdef DEBUG
        freopen("../in.txt", "r", stdin);
        freopen("../out.txt", "w", stdout);
    #endif
    #ifndef quickread
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    #endif

    int T=1; //scanf("%d", &T);
    while(T--) 
    {
        solve();
    }
    return 0;
}
